var math/big.intOne
17 uses
math/big (current package)
int.go#L30: var intOne = &Int{false, natOne}
int.go#L253: z.Add(z, intOne)
int.go#L255: z.Sub(z, intOne)
int.go#L304: z.Add(z, intOne)
int.go#L307: z.Sub(z, intOne)
int.go#L822: if d.Cmp(intOne) != 0 {
int.go#L860: if b.Cmp(intOne) == 0 {
int.go#L898: e := new(Int).Add(p, intOne) // e = p + 1
int.go#L920: beta.Sub(beta, intOne)
int.go#L933: s.Sub(p, intOne)
int.go#L941: n.Add(&n, intOne)
int.go#L949: y.Add(&s, intOne)
int.go#L959: for t.Cmp(intOne) != 0 {
intconv.go#L53: var _ fmt.Formatter = intOne // *Int must implement fmt.Formatter
intconv.go#L233: var _ fmt.Scanner = intOne // *Int must implement fmt.Scanner
rat.go#L64: z.b.Set(intOne)
rat.go#L445: if f := NewInt(0).lehmerGCD(nil, nil, &z.a, &z.b); f.Cmp(intOne) != 0 {